Faster Triangle-Triangle Intersection Tests
نویسندگان
چکیده
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Key-words: geometric predicates, low degree predicate, collision detection Tests Rapides d’Intersection de Triangles Résumé : Ce document présente une nouvelle méthode pour déterminer si deux triangles dans l’espace s’intersectent. Le code est trés efficace et nécessite une précision arithmétique minimale. Toutes les décisions de branchement consistent, en effet, à évaluer le signe de polynômes de degré trois. En outre, un test efficace est proposé pour le cas planaire. Mots-clés : prédicats géométriques, prédicat de bas degré, détection de collision Faster Triangle-Triangle Intersection Tests 3
منابع مشابه
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether two triangles embedded in three dimensions intersect. Our technique solves the basic sets of linear equations associated with the problem and exploits the strong relations between these sets to speed up their solution. M...
متن کاملERIT - A Collection of Efficient and Reliable Intersection Tests
We describe ERIT, a collection of C routines for eeciently and reliably handling intersection queries between pairs of primitive objects in 3D. ERIT supports intersection queries between the following pairs of primitives: triangle/line-segment, triangle/triangle, sphere/line-segment, sphere/triangle, cylinder/line-segment, cylinder/triangle, cylinder/sphere, cone/line-segment, cone/triangle, to...
متن کاملFast Ray-Triangle Intersections by Coordinate Transformation
Ray-triangle intersection is a crucial calculation in ray tracing. We present a new algorithm for finding these intersections, occupying a different place in the spectrum of time-space tradeoffs than existing algorithms do. Our algorithm provides faster ray-triangle intersection calculations at the expense of precomputing and storing a small amount of extra information for each triangle. Runnin...
متن کاملHardware-Accelerated Ray-Triangle Intersection Testing for High-Performance Collision Detection
We present a novel approach for hardware-accelerated collision detection. This paper describes the design of the hardware architecture for primitive inference testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. This paper focuses on the acceleration of ray-triangle intersection operation which is the one of the most important operations in various applications su...
متن کاملFast Ray-Triangle Intersection Computation Using Reconfigurable Hardware
We present a novel FPGA-accelerated architecture for fast collision detection among rigid bodies. This paper describes the design of the hardware architecture for several primitive intersection testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. We focus on the acceleration of ray-triangle intersection operation which is the one of the most important operations i...
متن کامل